Numerical analysis of deterministic and stochastic Petri nets with concurrent deterministic transitions
نویسندگان
چکیده
منابع مشابه
Transient Analysis of Deterministic and Stochastic Petri Nets with Concurrent Deterministic Transitions
This paper introduces an efficient numerical algorithm for transient analysis of deterministic and stochastic Petri nets (DSPNs) and other discrete-event stochastic systems with exponential and deterministic events. The proposed approach is based on the analysis of a general state space Markov chain (GSSMC) whose state equations constitute a system of multidimensional Fredholm integral equation...
متن کاملAnalysis of deterministic and stochastic Petri nets
We present a time and space efficient algorithm for computing steady state solutions of deterministic and stochastic Petri nets (DSPNs) with both stochastic and structural extensions. The algorithm can deal with different execution policies associated with deterministic transitions of a DSPN. The definition of a subordinated Markov chain (SMC) is refined to reduce the computational cost of deri...
متن کاملTransient Analysis of Deterministic and Stochastic Petri Nets with TimeNET
This paper descibes the transient analysis component for de-terministic and stochastic Petri nets which has recently been added to the software package TimeNET. The technique is based on the derivation of state equations by the method of supplementary variables. The system of equations consists of partial and ordinary diierential equations which are combined with initial and boundary conditions...
متن کاملDiscrete Deterministic and Stochastic Petri Nets
Petri nets augmented with timing specifications gained a wide acceptance in the area of performance and reliability evaluation of complex systems exhibiting concurrency, synchronization, and conflicts. The state space of time-extended Petri nets is mapped onto its basic underlying stochastic process, which can be shown to be Markovian under the assumption of exponentially distributed firing tim...
متن کاملModel checking CSLTA with Deterministic and Stochastic Petri Nets
CSLTA is a stochastic temporal logic for continuous-time Markov chains (CTMC), that can verify the probability of following paths specified by a Deterministic Timed Automaton (DTA). A DTA expresses both logic and time constraints over a CTMC path, yielding to a very flexible way of describing performance and dependability properties. This paper explores a model checking algorithm for CSLTA base...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Performance Evaluation
سال: 1996
ISSN: 0166-5316
DOI: 10.1016/s0166-5316(96)90046-2